Habilitation Report (abstract) Education New Techniques for Finite and Infinite Model Building in Automated Deduction
نویسندگان
چکیده
pliquées de Grenoble) with highest honours.
منابع مشابه
Automated Model Building
Preface On the history of the book: In the early 1990s several new methods and perspectives in automated deduction emerged. We just mention the superposition calculus, meta-term inference and schematization, deductive decision procedures, and automated model building. It was this last field which brought the authors of this book together. In 1994 they met at the Conference on Automated Deductio...
متن کاملLogic Programming and Partial Deduction for the Verification of Reactive Systems: An Experimental Evaluation (Abstract of ongoing work)
In earlier work it has been shown that finite state CTL model checking of reactive systems can be achieved by a relatively simple interpreter written in tabled logic programming. This approach is flexible in the sense that various specification formalisms can be easily targeted (e.g., Petri nets, CSP, ...). Moreover, infinite state CTL model checking can be performed by analysing this interpret...
متن کاملAbstraction-Based Partial Deduction for Solving Inverse Problems - A Transformational Approach to Software Verification
ion-Based Partial Deduction for Solving Inverse Problems – A Transformational Approach to Software Verification (Extended Abstract) Robert Glück and Michael Leuschel 1 DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark Email: [email protected] 2 Department of Electronics and Computer Science University of Southampton, Southampton SO17 1BJ, UK Email: mal@ecs...
متن کاملCut - offs and Automata in Formal Verification of Infinite - State Systems Habilitation
In this habilitation thesis, we discuss two complementary approaches to formal verification of infinite-state systems—namely, the use cut-offs and automata-based symbolic model checking (especially the so-called regular model checking). The thesis is based on extended versions of multiple conference and journal papers joint into a unified framework and accompanied with a significantly extended ...
متن کاملLogical Interpretation: Static Program Analysis Using Theorem Proving
This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices – a class of lattices defined on logical formulas in a logical theory – in an abstract interpretation framework. Abstract interpretation over logical lattices, called logical interpretation, raises new challenges for theorem proving. We pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1972